Rank-deficient submatrices of Fourier matrices
نویسندگان
چکیده
We consider the maximal rank-deficient submatrices of Fourier matrices. We do this by considering a hierarchical subdivision of these matrices into low rank blocks. We also explore some connections with the FFT, and with an uncertainty principle for Fourier transforms over finite Abelian groups.
منابع مشابه
Rank-deficient submatrices of Kronecker products of Fourier matrices
We provide a set of maximal rank-deficient submatrices of a Kronecker product of two matrices A ⊗ B, and in particular the Kronecker product of Fourier matrices F = Fn1 ⊗ . . . ⊗ Fnk . We show how in the latter case, maximal rank-deficient submatrices can be constructedas tilings of rank-one blocks. Such tilings exist for any subgroup of a suitable Abelian group associated to the matrix F . The...
متن کاملTargeted matrix completion
Matrix completion is a problem that arises in many dataanalysis settings where the input consists of a partiallyobserved matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume that the input partially-observed matrix is low rank. The success of these methods depends on the number of observed entries and the rank of the matrix; the larg...
متن کاملRank structured matrices: theory, algorithms and applications
In numerical linear algebra much attention has been paid to matrices that are sparse, i.e., containing a lot of zeros. For example, to compute the eigenvalues of a general dense symmetric matrix, this matrix is first reduced to a similar tridiagonal one using an orthogonal similarity transformation. The subsequent QR-algorithm performed on this n×n tridiagonal matrix, takes the sparse structure...
متن کاملThe Interplay of Ranks of Submatrices
A banded invertible matrix has a remarkable inverse. All “upper” and “lower” submatrices of have low rank (depending on the bandwidth in ). The exact rank condition is known, and it allows fast multiplication by full matrices that arise in the boundary element method. We look for the “right” proof of this property of . Ultimately it reduces to a fact that deserves to be better known: Complement...
متن کاملRectangular maximum-volume submatrices and their applications
A generalized and applicable to rectangular matrices definition of a volume of a matrix is given. Special case of this definition, so-called 2-volume, is studied: we generalize results for square maximum-volume submatrices to the case of rectangular maximal-volume submatrices and provide estimates for the growth of the coefficients and approximation error. Three promising applications of such s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006